#include<bits/stdc++.h>
using namespace std;
#define int long long


int solution_n3(int n) {
	int ans = 0;
	for (int i = 1; i <= n ; i++) {
		for (int j = i; j <= n; j++) {
			for (int k = j; k <= n; k++) {
				if (i * j * k <= n)
					ans++;
			}
		}
	}
	return ans;
}


int solution_n2(int n) {
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = i; j <= n; j++) {
			int k = n / i / j;
			ans += k >= j ? k + 1 - j : 0;
		}
	}
	return ans;
}


int solution_n1(int n) {

	//	for (int n = 1; n <= 200; n++) {
	//		ans = 0;
	//		for (int i = 1; i <= n; i++) {
	//			for (int j = i; j <= n; j++) {
	//				int k = n / i / j;
	//				ans += k >= j ? k + 1 - j : 0;
	//			}
	//		}
	//		cout << ans << ",";
	//	}

	int ans[] = {0, 1, 2, 3, 5, 6, 8, 9, 12, 14, 16, 17, 21, 22, 24, 26, 30, 31, 35, 36, 40, 42, 44, 45, 51, 53, 55, 58, 62, 63, 68, 69, 74, 76, 78, 80, 88, 89, 91, 93, 99, 100, 105, 106, 110, 114, 116, 117, 126, 128, 132, 134, 138, 139, 145, 147, 153, 155, 157, 158, 168, 169, 171, 175, 182, 184, 189, 190, 194, 196, 201, 202, 214, 215, 217, 221, 225, 227, 232, 233, 242, 246, 248, 249, 259, 261, 263, 265, 271, 272, 282, 284, 288, 290, 292, 294, 306, 307, 311, 315, 323, 324, 329, 330, 336, 341, 343, 344, 356, 357, 362, 364, 373, 374, 379, 381, 385, 389, 391, 393, 409, 411, 413, 415, 419, 422, 432, 433, 441, 443, 448, 449, 459, 461, 463, 469, 475, 476, 481, 482, 492, 494, 496, 498, 516, 518, 520, 524, 528, 529, 539, 540, 546, 550, 555, 557, 567, 568, 570, 572, 584, 586, 595, 596, 600, 605, 607, 608, 624, 626, 631, 635, 639, 640, 645, 649, 658, 660, 662, 663, 683, 684, 689, 691, 697, 699, 704, 706, 710, 716, 721, 722, 738, 739, 741, 746, 754, 755, 765, 766, 778};
	return ans[n];
}


signed main() {
//	system("start https://www.lanqiao.cn/problems/8259/learning/");

	int n;
	cin >> n;

	cout << solution_n1(n);

	return 0;
}
